Higher-Order Intensional Type Analysis
نویسنده
چکیده
Intensional type analysis provides the ability to analyze abstracted types at run time. In this paper, we extend that ability to higherorder and kind-polymorphic type constructors. The resulting language is elegant and expressive. We show through examples how it extends the repertoire of polytypic definitions and the domain of valid types for those
منابع مشابه
Higher-Order Intensional Type Analysis in Type-Erasure Semantics
Higher-order intensional type analysis is a way of defining type-indexed operations, such as map, fold and zip, based on run-time type information. However, languages supporting this facility are naturally defined with a type-passing semantics, which suffers from a number of drawbacks. This paper, describes how to recast higher-order intensional type analysis in a type-erasure semantics. The re...
متن کاملMelvin Fitting Intensional Logic — Beyond First Order
Classical first-order logic can be extended in two different ways to serve as a foundation for mathematics: introduce higher orders, type theory, or introduce sets. As it happens, both approaches have natural analogs for quantified modal logics, both approaches date from the 1960’s, one is not very well-known, and the other is well-known as something else. I will present the basic semantic idea...
متن کاملA Type System Theory for Higher-Order Intensional Logic Support for Variable Bindings in Hybrid Intensional-Imperative Programs in GIPSY
We describe a type system for a platform called the General Intensional Programming System (GIPSY), designed to support intensional programming languages built upon intensional logic and their imperative counter-parts for the intensional execution model. In GIPSY, the type system glues the static and dynamic typing between intensional and imperative languages in its compiler and runtime environ...
متن کاملHigher-Order Functional Languages and Intensional Logic
In this paper we demonstrate that a broad class of higher-order functional programs can be transformed into semantically equivalent multidimensional intensional programs that contain only nullary variable definitions. The proposed algorithm systematically eliminates userdefined functions from the source program, by appropriately introducing context-manipulation (i.e., intensional) operators. Th...
متن کاملA Higher-order Fine-grained Logic for Intensional Semantics
This paper describes a higher-order logic with fine-grained intensionality (FIL). Unlike traditional Montogovian type theory, intensionality is treated as basic, rather than derived through possible worlds. This allows for fine-grained intensionality without impossible worlds. Possible worlds and modalities are defined algebraically. The proof theory for FIL is given as a set of tableau rules, ...
متن کامل